An Algorithmic Involution for p(n)
نویسندگان
چکیده
An involution φ is given on the set of all integer partitions of n. The cardinality of the fixed point set of φ is < n and has the same parity as p(n). Moreover, φ(λ) can found in polynomial time.
منابع مشابه
On centralizers of prime rings with involution
Let $R$ be a ring with involution $*$. An additive mapping $T:Rto R$ is called a left(respectively right) centralizer if $T(xy)=T(x)y$ (respectively $T(xy)=xT(y)$) for all $x,yin R$. The purpose of this paper is to examine the commutativity of prime rings with involution satisfying certain identities involving left centralizers.
متن کاملAn algorithmic sign-reversing involution for special rim-hook tableaux
Eğecioğlu and Remmel [2] gave an interpretation for the entries of the inverse Kostka matrix K in terms of special rim-hook tableaux. They were able to use this interpretation to give a combinatorial proof that KK = I but were unable to do the same for the equation KK = I. We define an algorithmic signreversing involution on rooted special rim-hook tableaux which can be used to prove that the l...
متن کاملAlgorithmic Aspects of Switch Cographs
This paper introduces the notion of involution module, the first generalization of the modular decomposition of 2-structure which has a unique linear-sized decomposition tree. We derive an O(n) decomposition algorithm and we take advantage of the involution modular decomposition tree to state several algorithmic results. Cographs are the graphs that are totally decomposable w.r.t modular decomp...
متن کاملFlag Varieties and Interpretations of Young Tableau Algorithms
The conjugacy classes of nilpotent n × n matrices can be parametrised by partitions λ of n, and for a nilpotent η in the class parametrised by λ, the variety Fη of η-stable flags has its irreducible components parametrised by the standard Young tableaux of shape λ. We indicate how several algorithmic constructions defined for Young tableaux have significance in this context, thus extending Stei...
متن کاملComparison of logistic regression and neural network models in predicting the outcome of biopsy in breast cancer from MRI findings
Background: We designed an algorithmic model based on the logistic regression analysis and a non-algorithmic model based on the Artificial Neural Network (ANN). Materials and methods: The ability of these models was compared together in clinical application to differentiate malignant from benign breast tumors in a study group of 161 patients' records. Each patient’s record consisted of 6 subjec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Algorithms
دوره 15 شماره
صفحات -
تاریخ انتشار 1993